Genetic Search For Fixed Channel Assignment Problem With Limited Bandwidth
نویسندگان
چکیده
We propose a hybrid genetic algorithm for the xed channel assignment problem with limited bandwidth. A local optimization algorithm was devised to enhance the genetic algorithm's ne-tunning. In a matrix representation, the local optimization algorithm improves on a chromosome by horizontal and vertical moves of channels. The crossover is directly performed on two-dimensional matrices. Experimental results showed dramatic improvement against previous works.
منابع مشابه
An Efficient Hybrid Genetic Algorithm for a Fixed Channel Assignment Problem with Limited Bandwidth
We need an efficient channel assignment algorithm for increasing channel re-usability, reducing call-blocking rate and reducing interference in any cellular systems with limited bandwidth and a large number of subscribers. We propose an efficient hybrid genetic algorithm for a fixed channel assignment problem with limited bandwidth constraint. The proposed GA finds a good sequence of codes for ...
متن کاملAn Efficient Genetic Algorithm For Fixed Channel Assignment Problem With Limited Bandwidth Constraint
This paper proposes a new efÞcient genetic algorithm for a Þxed channel assignment problem with limited bandwidth constraint. Results are given which show that our GAproduces far better solutions than the previously proposed GA the problem.
متن کاملFixed Channel Assignment in Cellular Radio Networks Using a Modified Genetic Algorithm
With the limited frequency spectrum and an increasing demand for cellular communication services, the problem of channel assignment becomes increasingly important. However, finding a conflict-free channel assignment with the minimum channel span is NP hard. Therefore, we formulate the problem by assuming a given channel span. Our objective is to obtain a conflict-free channel assignment among t...
متن کاملA Viterbi-like algorithm with adaptive clustering for channel assignment in cellular radio networks
A new channel assignment algorithm, called the Viterbi-like algorithm (VLA), is proposed to solve the channel assignment problem in cellular radio networks. The basic idea of the proposed algorithm is step-by-step (sequential) channel assignment with the objectives of minimum bandwidth required at every step, subject to adjacent channel and cochannel separation constraints. The VLA provides the...
متن کاملA Novel Multicast Tree Construction Algorithm for Multi-Radio Multi-Channel Wireless Mesh Networks
Many appealing multicast services such as on-demand TV, teleconference, online games and etc. can benefit from high available bandwidth in multi-radio multi-channel wireless mesh networks. When multiple simultaneous transmissions use a similar channel to transmit data packets, network performance degrades to a large extant. Designing a good multicast tree to route data packets could enhance the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002